Schedulability Analysis of PWM Tasks for the UPMSat-2 ADCS
نویسندگان
چکیده
This paper discusses the schedulability analysis of a PulseWidth Modulation (PWM) control algorithm of an on-board spacecraft software system. The UPMSat-2 case study is used to discuss the scheduling approach of the task set of the Attitude Determination and Control System (ADCS). The Ravenscar profile is a key element of the project in order to ensure temporal predictatibilty and analysability. However, the task population must be maintained low as available computational resources are limited. As a result, the PWM task has not a single activation point, which prevents a traditional schedulability analysis. The approach used by the authors to carry out the scheduling analysis is presented in the paper.
منابع مشابه
Analysis of normal-appearing white matter in multiple sclerosis: comparison of diffusion tensor MR imaging and magnetization transfer imaging.
BACKGROUND AND PURPOSE Our purpose was to compare diffusion tensor MR and magnetization transfer imaging in assessing normal-appearing white matter (WM) regions in multiple sclerosis (MS). METHODS Diffusion tensor, magnetization transfer, and conventional MR imaging were performed in 12 patients with MS. Fractional anisotropy, apparent diffusion coefficients (ADCs), and magnetization transfer...
متن کاملDecidable and Undecidable Problems in Schedulability Analysis Using Timed Automata
We study schedulability problems of timed systems with nonuniformly recurring computation tasks. Assume a set of real time tasks whose best and worst execution times, and deadlines are known. We use timed automata to describe the arrival patterns (and release times) of tasks. From the literature, it is known that the schedulability problem for a large class of such systems is decidable and can ...
متن کاملA Practical Schedulability Analysis for Generalized Sporadic Tasks in Distributed Real-Time Systems
Existing off-line schedulability analysis for real-time systems can only handle periodic or sporadic tasks with known minimum inter-arrival times. Modeling sporadic tasks with fixed minimum inter-arrival times is a poor approximation for systems in which tasks arrive in bursts, but have longer intervals between the bursts. In such cases, schedulability analysis based on the existing sporadic ta...
متن کاملA Generic Approach to Schedulability Analysis of Real-Time Tasks
In off-line schedulability tests for real time systems, tasks are usually assumed to be periodic, i.e. they are released with fixed rates. To relax the assumption of complete knowledge on arrival times, we propose to use timed automata to describe task arrival patterns. In a recent work, it is shown that for fixed priority scheduling strategy and tasks with only timing constraints (i.e. executi...
متن کاملProbabilistic Performance Guarantee for Real - Time Tasks
This paper describes how the scheduling algorithms and schedulability analysis methods developed for periodic tasks can be extended to provide performance guarantees to semi-periodic tasks. Like periodic tasks, the requests in a semi-periodic task are released regularly. However, their computation times vary widely. We focus on systems where the total maximum utilization of the tasks on each pr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015